Static Bandwidth Allocation for Input-Queued Switches with strict QoS Bounds

Input buffered switches are known to suffer from head-of-line blocking that limits the throughput to 58.6%. It has been shown that with virtual output queueing (VOQ) 100% throughput can be achieved using arbitration algorithms. While dynamic algorithms decide based on some metrics in each time slot, a static arbitration called allocation reserves time slots for specific connections in advance. This fixed schedule offers bandwidth guarantees, strict delay bounds for worst-case traffic and active per-flow traffic shaping. In this paper we treat the performance, dimensioning and connection admission control of services that are treated with allocation. This is extended to provide bounds for the end-to-end delay. Several variants, the hybrid TDM/ATM, priority and connection allocation are discussed.